An FFT Based Fast Poisson Solver on Spherical Shells
نویسندگان
چکیده
منابع مشابه
On Using a Fast Multipole Method-based Poisson Solver in an Approximate Projection Method
Approximate projection methods are useful computational tools for solving the equations of timedependent incompressible flow. In this report we will present a new discretization of the approximate projection in an approximate projection method. The discretizations of divergence and gradient will be identical to those in existing approximate projection methodology using cell-centered values of p...
متن کاملAn efficient solver for volumetric scattering based on fast spherical harmonics transforms
The Helmholtz equation arises in the study of electromagnetic radiation, optics, acoustics, etc. In spherical coordinates, its general solution can be written as a spherical harmonic series which satisfies the radiation condition at infinity, ensuring that the wave is outgoing. The boundary condition at infinity is hard to enforce with a finite element method since a suitable approximation need...
متن کاملParallel Distributed Fast 3d Poisson Solver
The fast Poisson solvers based on FFT computations are among the fastest techniques to solve Poisson problems on uniform grids. In this report, we present two parallel distributed implementations of a 3D fast Poisson solver in the context of the atmospheric simulation code Meso-NH 2]. The rst parallel implementation consists in implementing data movement between each computational step so that ...
متن کاملImprovements of a Fast Parallel Poisson Solver on Irregular Domains
We discuss the scalable parallel solution of the Poisson equation on irregularly shaped domains discretized by finite differences. The symmetric positive definite system is solved by the preconditioned conjugate gradient algorithm with smoothed aggregation (SA) based algebraic multigrid (AMG) preconditioning. We investigate variants of the implementation of SA-AMG that lead to considerable impr...
متن کاملpfft++ – A general and extensible fast integral equation solver based on a pre-corrected FFT algorithm
This paper describes an efficient algorithm to solve integral equations with complicated kernels. The algorithm can handle both piece-wise constant and high-order elements in the collocation method and the Galerkin’s method. A general and extensible fast integral equation solver has been developed using the c++ generic programming technique. Numerical experiments show that the memory usage and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Computational Physics
سال: 2011
ISSN: 1815-2406,1991-7120
DOI: 10.4208/cicp.060509.080609s